A Hybrid Solution Approach Based on Benders Decomposition and Meta-Heuristics to Solve Supply Chain Network Design Problem

Authors

  • Barzinpour, F. School of Industrial Engineering, Iran University of Science and Technology, Tehran, Iran
  • Papi, A. School of Industrial Engineering, Iran University of Science and Technology, Tehran, Iran
  • Pishvaee, M. School of Industrial Engineering, Iran University of Science and Technology, Tehran, Iran
Abstract:

Supply Chain Network Design (SCND) is a strategic supply chain management problem that determines its configuration. This mainly focuses on the facilities location, capacity sizing, technology selection, supplier selection, transportation, allocation of production and distribution facilities to the market, and so on. Although the optimal solution of the SCND problem leads to a significant reduction in the supply chain costs, but placing this problem in the NP_Hard order makes it impossible for some networks (especially large scale) to achieve the optimal solution using classical algorithms. In this research, we present a hybrid solution method based on the benders decomposition and genetic algorithm for a four-echelon SCND problem. The proposed approach inherits the run time efficiency from the metaheuristics and decomposition method, and ensures convergence to the optimal solution using Banders method. We consider major design and planning decisions in the SCND problem, to provide a more comprehensive model and solution approach which is compatible to the real supply SCND problem. To evaluate performance and effectiveness of the proposed hybrid benders decomposition and genetic algorithm (HBDGA) approach, some random test problems are generated in various scales. Numerical results show that the proposed HBDGA solution approach can overcome the speed weakness of the classic benders decomposition. In addition, proposed HBDGA, unlike meta-heuristic methods, guarantees global optimization of the SCND problem.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

A Benders' Decomposition Method to Solve Stochastic Distribution Network Design Problem with Two Echelons and Inter-Depot Transportation

 In many practical distribution networks, managers face significant uncertainties in demand, local price of building facilities, transportation cost, and macro and microeconomic parameters. This paper addresses design of distribution networks in a supply chain system which optimizes the performance of distribution networks subject to required service level. This service level, which is consider...

full text

Benders Decomposition Algorithm for Competitive Supply Chain Network Design under Risk of Disruption and Uncertainty

In this paper, bi-level programming is proposed for designing a competitive supply chain network. A two-stage stochastic programming approach has been developed for a multi-product supply chain comprising a capacitated supplier, several distribution centers, retailers and some resellers in the market. The proposed model considers demand’s uncertainty and disruption in distribution centers and t...

full text

A Benders Decomposition Method to Solve an Integrated Logistics Network Designing Problem with Multiple Capacities

In this paper, a new model is proposed for the integrated logistics network designing problem. In many research papers in this area, it is assumed that there is only one option for the capacity of each facility in the network. However, this is not a realistic assumption because generally there may be many possible options for the capacity of the facility that is being established. Usually the c...

full text

A Modified Benders Decomposition Algorithm for Supply Chain Network Design under Risk Consideration

In today’s competitive business environment, the design and management of supply chainnetwork is one of the most important challenges that managers encounter. The supply chain network shouldbe designed for satisfying of customer demands as well as minizing the total system costs. This paper presentsa multi-period multi-stage supply chain network design problem under demand uncertainty. The prob...

full text

A New Hybrid Meta-Heuristics Approach to Solve the Parallel Machine Scheduling Problem Considering Human Resiliency Engineering

This paper proposes a mixed integer programming model to solve a non-identical parallel machine (NIPM) scheduling with sequence-dependent set-up times and human resiliency engineering. The presented mathematical model is formulated to consider human factors including Learning, Teamwork and Awareness. Moreover, processing time of jobs are assumed to be non-deterministic and dependent to their st...

full text

Combining Two Heuristics to Solve a Supply Chain Optimization Problem

In this paper, we consider a real-life supply chain optimization problem concerned with supplying a product from multiple warehouses to multiple geographically dispersed retailers. Each retailer faces a deterministic and period-dependent demand over some finite planning horizon. The demand of each retailer is satisfied by the supply from some predetermined warehouse through a fleet of vehicles ...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 17  issue 4

pages  63- 88

publication date 2020-12

By following a journal you will be notified via email when a new issue of this journal is published.

Keywords

No Keywords

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023